Identical coupled task scheduling: polynomial complexity of the cyclic case
نویسندگان
چکیده
Coupled task problems arise in connection with radar systems. For the transmission and reception of an electromagnetic pulse the radar (the processor) has to execute two tasks that are separated by some fixed time interval. Most of the complexity issues for scheduling a set of such pairs of two-operation tasks have been settled. However, the complexity status is still unknown for the identical coupled task problem, where multiple copies of a single coupled task are to be processed. The purpose of this article is prove the polynomial complexity of this problem in the cyclic case.
منابع مشابه
Polynomial complexity of the cyclic identical coupled task problem
Coupled-tasks were introduced by Shapiro in 1980 for scheduling the operations of a radar [19]. The radar emits a pulse that is transmitted to a target and reflected back to the radar, which receives the pulse. Hence the radar must process two operations per task (emission and reception), and those operations are separated by a fixed duration. The coupled task scheduling problem is then to proc...
متن کاملIdentical Coupled Task Scheduling Problem: The Finite Case
Scheduling tasks on a radar system can be modeled as a multioperation scheduling problem where tasks are composed of two operations separated by a fixed duration. Tasks have to be scheduled on a single machine and the aim is to minimize the makespan. The complexity status of this problem has been settled for various cases but the one where all tasks are identical remains open. This paper aims a...
متن کاملA Polynomial Algorithm for 2-Cyclic Robotic Scheduling
In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomia...
متن کاملParameterized Complexity of a coupled-task scheduling problem
In this article, we investigate the parameterized complexity of coupled-task scheduling in the presence of compatibility constraint given by a compatibility graph. In this model, each task contains two sub-tasks delayed by an idle time, and a subtask of a task can be performed during the idle time of another one if, and only if, the two tasks are compatible. We consider a parameterized version ...
متن کاملScheduling of coupled tasks and one-machine no-wait robotic cells
Coupled task scheduling problems were first studied more than 25 years ago. Several complexity results have been established in the meantime, but the status of the identical task case still remains unsettled. We describe a new class of equivalent one-machine no-wait robotic cell problems. It turns out that scheduling of identical coupled tasks corresponds to the production of a single part type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Scheduling
دوره 18 شماره
صفحات -
تاریخ انتشار 2015